Prime and prime power divisibility of Catalan numbers
نویسندگان
چکیده
منابع مشابه
Prime power terms in elliptic divisibility sequences
We study a problem on specializations of multiples of rational points on elliptic curves analogous to the Mersenne problem. We solve this problem when descent via isogeny is possible by giving explicit bounds on the indices of prime power terms in elliptic divisibility sequences associated to points in the image of a nontrivial isogeny. We also discuss the uniformity of these bounds assuming th...
متن کاملDivisibility of generalized Catalan numbers
We define a q generalization of weighted Catalan numbers studied by Postnikov and Sagan, and prove a result on the divisibility by p of such numbers when p is a prime and q its power.
متن کاملTrapezoidal Diagrams, Upward Triangulations, and Prime Catalan Numbers
The d-dimensional Catalan numbers form a well-known sequence of numbers which count balanced bracket expressions over an alphabet of size d. In this paper, we introduce and study what we call d-dimensional prime Catalan numbers, a sequence of numbers which count only a very specific subset of indecomposable balanced bracket expressions. We further introduce the notion of a trapezoidal diagram o...
متن کاملPrime Slaughter: Playful Prime Numbers
Starting from the difficulty of creating playful representation of domain-specific abstract concepts, this study discusses the design of Prime Slaughter, a computer game aimed at facilitating individual sense-making of abstract mathematical concepts. Specifically the game proposes a transpositionmathematical concepts. Specifically the game proposes a transposition of primality and factorization...
متن کاملGeneralized Catalan Numbers: Linear Recursion and Divisibility
We prove a linear recursion for the generalized Catalan numbers Ca(n) := 1 (a−1)n+1 ( an n ) when a ≥ 2. As a consequence, we show p |Cp(n) if and only if n 6= p−1 p−1 for all integers k ≥ 0. This is a generalization of the well-known result that the usual Catalan number C2(n) is odd if and only if n is a Mersenne number 2 k − 1. Using certain beautiful results of Kummer and Legendre, we give a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1973
ISSN: 0097-3165
DOI: 10.1016/0097-3165(73)90072-1